TABU SEARCH APPROACH FOR TYPE 2 PROBLEMS OF ASSEMBLY LINE BALACING
نویسندگان
چکیده
منابع مشابه
Tabu Search With Target Analysis To The Assembly Line Balancing Problems -- An Artificial Intelligence Approach
This paper describes the application of tabu search, a recent heuristic technique for combinatorial optimization problems, to the assembly line balancing problems. Computational experiments with different search strategies have been performed for some assembly ine problems from literature. Computational results show that except for few cases tabu search always finds optimal solutions.
متن کاملA Hybrid Tabu Search Method for Assembly Line Balancing
A new hybrid tabu search (HTS) method for solving assembly line balancing problems is proposed in this paper. The tabu search (TS) method is combined with the genetic algorithm (GA) to identify and provide solutions for assembly line balancing problems. With the proposed HTS method, the TS method can well address the number of tasks assigned for each workstation, while the GA can also assign th...
متن کاملA Tabu Search Approach with Double Tabu-List for Multidimensional Knapsack Problems
The knapsack problems are a classic NP-hard problem in the combinational optimization. Inspired by the conclusion of the cognitive psychology about the human memory system, a Tabu Search method based on Double Tabu-List (DTL-TS) has been proposed to solve it. With the addition of the search strategy of intensification and diversification, the excellent experiment results have been gotten. Compa...
متن کاملTabu Search for Maximal Constraint Satisfaction Problems
This paper presents a Tabu Search (TS) algorithm for solving maximal constraint satisfaction problems. The algorithm was tested on a wide range of random instances (up to 500 variables and 30 values). Comparisons were carried out with a min-connicts+random-walk (MCRW) algorithm. Empirical evidence shows that the TS algorithm nds results which are better than that of the MCRW algorithm.the TS al...
متن کاملScatter tabu search for multiobjective clustering problems
We propose a hybrid heuristic procedure based on scatter search and tabu search for the problem of clustering objects to optimize multiple criteria. Our goal is to search for good approximations of the efficient frontier for this class of problems and provide a means for improving decision making in multiple application areas. Our procedure can be viewed as an extension of SSPMO (a scatter sear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Technology Development Journal
سال: 2011
ISSN: 1859-0128
DOI: 10.32508/stdj.v14i2.1925